An improved soft-kill BESO algorithm for optimal distribution of single or multiple material phases
نویسندگان
چکیده
منابع مشابه
Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm
Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...
متن کاملAn Improved Search Algorithm for Optimal Multiple-Sequence Alignment
Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP -hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers int...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملTissue distribution of artemisinin in broiler chickens following single or multiple oral administration
Background: Artemisinin is commonly used for the treatment of malaria, but recently has been considered as a potential substance to control poultry coccidiosis. OBJECTIVES: The aim of the present study was to determine the tissue distribution of artemisinin following single or multiple oral administration of different doses in broiler chickens. METHODS: A total number of 390 one day old Ross br...
متن کاملAn Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that the sum of the numbers assigned to each bin does not exceed the bin capacity. We present two improvements to our previous bin-completion algorithm. The first speeds up the constant factor per node generation, and the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2015
ISSN: 1615-147X,1615-1488
DOI: 10.1007/s00158-015-1268-2